Nonmonotonic Reasoning: Towards Efficient Calculi and Implementations

نویسندگان

  • Jürgen Dix
  • Ulrich Furbach
  • Ilkka Niemelä
چکیده

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

KLM Logics of Nonmonotonic Reasoning: Calculi and Implementations

We present proof methods for the logics of nonmonotonic reasoning defined by Kraus, Lehmann and Magidor (KLM). We introduce tableaux calculi (called T S) for all KLM logics. We provide decision procedures for KLM logics based on these calculi, and we study their complexity. Finally, we describe KLMLean 2.0, a theorem prover implementing the calculi T S inspired by the “lean” methodology. KLMLea...

متن کامل

Nonmonotonic Skeptical Consequence Relation in Constrained Default Logic

This paper presents a study of the nonmonotonic consequence relation which models the skeptical reasoning formalised by constrained default logic. The nonmonotonic skeptical consequence relation is defined using the sequent calculus axiomatic system. We study the formal properties desirable for a “good” nonmonotonic relation: supraclassicality, cut, cautious monotony, cumulativity, absorption, ...

متن کامل

A Compositional Reasoning System for Executing Nonmonotonic Theories of Reasoning

An agent that is reasoning about the world often needs to draw (defeasible) conclusions that are not logically entailed by its (incomplete) knowledge about the world. Nonmonotonic reasoning systems can be used to model these reasoning patterns. Implementations of agents that can reason in a defeasible manner need to include an implemented nonmonotonic reasoning system. In different applications...

متن کامل

Axiomatization of Credulous Reasoning in Rational Default Logic

Nonmonotonic reasoning is succesfully formalized by the class of default logics. In this paper we introduce an axiomatic system for credulous reasoning in rational default logic. Based on classical sequent calculus and anti-sequent calculus, an abstract characterization of credulous nonmonotonic default inference in this variant of default logic is presented.

متن کامل

Implementing Modal Extensions of Defeasible Logic for the Semantic Web

Defeasible reasoning is a nonmonotonic reasoning approach in which the gaps due to incomplete information are closed through the use of defeasible rules. Defeasible logic (Nute 1994) and its variants are an important family of defeasible reasoning methods. It is a simple, efficient but flexible non-monotonic formalism that offers many reasoning capabilities embodies the concept of preference an...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2001